Computing Hilbert Class Polynomials
نویسندگان
چکیده
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm which uses the class group action on CM-curves over finite fields. Our run time analysis gives tighter bounds for the complexity of all known algorithms for computing HD, and we show that all methods have comparable run times.
منابع مشابه
Computing Vertex PI, Omega and Sadhana Polynomials of F12(2n+1) Fullerenes
The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as PIv (G) euv nu (e) nv (e). Then Omega polynomial (G,x) for counting qoc strips in G is defined as (G,x) = cm(G,c)xc with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is constructed. ...
متن کاملRamanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this method is the computation of the roots of a special type of class polynomials, called Hilbert polynomials. However, there are several polynomials, called class polynomials, which can be used in the CM method and have much s...
متن کاملIntroducing Ramanujan’s Class Polynomials in the Generation of Prime Order Elliptic Curves
Complex Multiplication (CM) method is a frequently used method for the generation of prime order elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this method is the computation of the roots of a special type of class polynomials, called Hilbert polynomials. These polynonials are uniquely determined by the CM discriminant D. The disadvantage of these polynomial...
متن کاملGenerating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the roots of a special type of class field polynomials with the most commonly used being the Hilbert and Weber ones, uniquely determined by the CM discriminant D. In attempting to construct prime order ECs using Weber pol...
متن کاملImproved Crt Algorithm for Class Polynomials in Genus
We present a generalization to genus 2 of the probabilistic algorithm of Sutherland for computing Hilbert class polynomials. The improvement over the Bröker-Gruenewald-Lauter algorithm for the genus 2 case is that we do not need to find a curve in the isogeny class whose endomorphism ring is the maximal order; rather, we present a probabilistic algorithm for “going up” to a maximal curve (a cur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008